Describing short paths in plane graphs of girth at least 5
نویسندگان
چکیده
منابع مشابه
The distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملExcluding Minors In Nonplanar Graphs Of Girth At Least Five
A graph is quasi 4-connected if it is simple, 3-connected, has at least five vertices, and for every partition (A, B, C) of V (G) either |C| ≥ 4, or G has an edge with one end in A and the other end in B, or one of A,B has at most one vertex. We show that any quasi 4-connected nonplanar graph with minimum degree at least three and no cycle of length less than five has a minor isomorphic to P− 1...
متن کاملPlanar graphs with girth at least 5 are (3, 5)-colorable
A graph is (d1, . . . , dr )-colorable if its vertex set can be partitioned into r sets V1, . . . , Vr where themaximum degree of the graph induced by Vi is at most di for each i ∈ {1, . . . , r}. Let Gg denote the class of planar graphs with minimum cycle length at least g . We focus on graphs in G5 since for any d1 and d2, Montassier and Ochem constructed graphs in G4 that are not (d1, d2)-co...
متن کاملOn 3-choosable planar graphs of girth at least 4
Let G be a plane graph of girth at least 4. Two cycles of G are intersecting if they have at least one vertex in common. In this paper, we show that if a plane graph G has neither intersecting 4-cycles nor a 5-cycle intersecting with any 4-cycle, then G is 3-choosable, which extends one of Thomassen’s results [C. Thomassen, 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser. B 64 (...
متن کاملLocating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5
Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the dominating set. In this paper, we study the size of a smallest locating-dominating set or identifying code for graphs of girth at least 5 and o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.09.014